Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
701	The x-and-y-axes travelling salesman problem Eranda C ¸ ela∗ Vladimir Deineko†‡ Add to Reading List Source URL: www.opt.math.tu-graz.ac.at Language: English - Date: 2012-08-17 06:11:47 NP-complete problems Operations research Elementary mathematics Travelling salesman problem Computational complexity theory Analytic geometry Combinatorial optimization Distance Cartesian coordinate system Mathematics Theoretical computer science Applied mathematics
702	Exact Algorithms and Fixed-Parameter Tractability Summary of Dagstuhl Seminar[removed]July–29. July 2005 Rod Downey 1 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2006-01-19 05:18:59 NP-complete problems Analysis of algorithms Matroid theory Parameterized complexity Complexity classes Clique problem Vertex cover Time complexity Matroid Theoretical computer science Computational complexity theory Mathematics
703	The Complexity of Unique -SAT: An Isolation Lemma for -CNFs Chris Calabro Russell Impagliazzo Valentine Kabanets Ramamohan Paturi Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2007-10-29 20:04:40 NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Logic in computer science Conjunctive normal form Local search PP NP-complete Theoretical computer science Computational complexity theory Applied mathematics
704	May 21, [removed]Spring 2008 Final Exam Introduction to Algorithms Massachusetts Institute of Technology Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2008-12-08 16:50:45 Analysis of algorithms Binary trees Asymptotic analysis B-tree Big O notation Time complexity Shortest path problem AVL tree Heap Theoretical computer science Mathematics Computational complexity theory
705	40 CP1 Percolation of Conductivity for Carbon Nanotubes The problem of the percolation of conductivity that occurs from the suspension of carbon nanotubes in a nonconductive polymer matrix is of considerable interest fo Add to Reading List Source URL: www.siam.org Language: English - Date: 2008-04-08 09:50:54 Solid mechanics Computational chemistry Deformation Materials science Aerodynamics Molecular dynamics Computer simulation Scientific modelling Fluid dynamics Mechanics Physics Science
706	A Personal View of Average-Case Complexity Russell Impagliazzo Computer Science and Engineering UC, San Diego 9500 Gilman Drive La Jolla, CA[removed] Add to Reading List Source URL: stuff.mit.edu Language: English - Date: 2009-05-25 23:54:59 Complexity classes Mathematical optimization Structural complexity theory Analysis of algorithms P versus NP problem NP-complete NP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics
707	Hallucination Helps: Energy Efficient Virtual Circuit Routing Antonios Antoniadis∗ Benjamin Moseley§ Sungjin Im† Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2013-07-07 11:17:18 Combinatorial optimization Operations research Network flow Analysis of algorithms Computational complexity theory Time complexity Shortest path problem Cut Flow network Theoretical computer science Mathematics Applied mathematics
708	Microsoft Word - S2_Artificial_intelligence Add to Reading List Source URL: emaro.irccyn.ec-nantes.fr Language: English - Date: 2014-11-11 09:55:43 Neuroscience Open problems STUDENT Artificial Intelligence: A Modern Approach Artificial intelligence Dario Floreano Problem solving Neural network Prentice Hall Computational neuroscience Science Knowledge
709	covering-revision-without-comments.dvi Add to Reading List Source URL: dss.in.tum.de Language: English - Date: 2013-01-24 06:29:17 Complexity classes NP-hard NP-complete P versus NP problem NP Polynomial hierarchy Polynomial P Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
710	Matching as a Non-Cooperative Game Andrea Albarelli, Samuel Rota Bul`o, Andrea Torsello, and Marcello Pelillo Dipartimento di Informatica - Universit`a Ca’ Foscari via Torino, [removed]Venice Italy {aalbarel,srotab Add to Reading List Source URL: www.select.cs.cmu.edu Language: English - Date: 2009-11-17 22:13:37 Game theory NP-complete problems Combinatorial optimization Matching Nash equilibrium Subgraph isomorphism problem Pattern matching Theoretical computer science Mathematics Computational complexity theory

UPDATE